Constraint Satisfaction Problems in Clausal Form II: Minimal Unsatisfiability and Conflict Structure
نویسندگان
چکیده
منابع مشابه
Constraint satisfaction problems in clausal form: Autarkies and minimal unsatisfiability
We consider the problem of generalising boolean formulas in conjunctive normal form by allowing non-boolean variables, where our goal is to maintain combinatorial properties. Requiring that a literal involves only a single variable, the most general form of literals is given by the well-known “signed literals”, however we will argue that only the most restricted form of generalised clause-sets,...
متن کاملConstraint satisfaction problems in clausal form
This is the report-version of a mini-series of two articles [60, 61] on the foundations of conjunctive normal forms with non-boolean variables. These two parts are here bundled in one report, each part yielding a chapter. Part I We consider the problem of generalising boolean formulas in conjunctive normal form by allowing non-boolean variables, with the goal of maintaining combinatorial proper...
متن کاملConstraint Satisfaction Problems II
There are two ways in which the SAT problems can be framed: satisfiability problem and optimization problem. The optimization problem asks what is the largest number of clauses we can satisfy. The satisfiability problem is a special case of the optimization problem: it asks whether OPT (φ) = n, where n is the number of clauses in φ. It is obvious that MAX-3SAT is NP-hard since 3SAT itself is NP...
متن کاملThe Structure of Tractable Constraint Satisfaction Problems
We give a survey of recent results on the complexity of constraint satisfaction problems. Our main emphasis is on tractable structural restrictions.
متن کاملConflict Directed Variable Selection Strategies for Constraint Satisfaction Problems
It is well known that the order in which variables are instantiated by a backtracking search algorithm can make an enormous difference to the search effort in solving CSPs. Among the plethora of heuristics that have been proposed in the literature to efficiently order variables during search, a significant recently proposed class uses the learning-from-failure approach. Prime examples of such h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Informaticae
سال: 2011
ISSN: 0169-2968
DOI: 10.3233/fi-2011-429